Low SNR – When Only Decoding
نویسندگان
چکیده
We investigate the issue of distributed receiver cooperation in a multiple-relay network with memoryless independent fading channels, where the channel state information can’t be obtained. The received signals at distributed receiving nodes are first compressed or quantized before being sent to the decoder via rate-limited cooperation channels for joint processing. We focus on the low SNR regime and analyze the capacity bounds using network equivalence theory and a multiple-layer binning peaky frequency shift keying (FSK). When the received signals at the relaying nodes are in low SNR regime and the cooperation rates are not sufficiently high, compressed/quantized observations at relaying nodes become useless and only decoding can help.
منابع مشابه
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality
This study presents a novel technique to estimate the computational complexity of sequential decoding using the Berry-Esseen theorem. Unlike the theoretical bounds determined by the conventional central limit theorem argument, which often holds only for sufficiently large codeword length, the new bound obtained from the Berry-Esseen theorem is valid for any blocklength. The accuracy of the new ...
متن کاملJPEG2000 High-Speed SNR Progressive Decoding Scheme
An efficient scheme for JPEG2000 SNR progressive decoding is proposed, which is capable of handling JPEG2000 compressed image data with SNR progressiveness. In order to avoid entropy decoding of the same compressed data more than once when decoding SNR progressive images, two techniques are introduced in our decoding scheme; reuse of intermediate decoding result and differential inverse discret...
متن کاملOn the Optimality of MMSE-GDFE Pre-Processed Sphere Decoding
In this work, we consider maximum likelihood (ML) sequence detection in MIMO linear channels corrupted by additive white Gaussian noise. While sphere decoding (SpD) algorithms have been developed to reduce the average complexity of ML detection, the average complexity of classical SpD can itself be impractical in low-SNR settings or when the channel is ill-conditioned. In response, sequential d...
متن کاملLow-complexity high-throughput decoding architecture for convolutional codes
Sequential decoding can achieve a very low computational complexity and short decoding delay when the signalto-noise ratio (SNR) is relatively high. In this article, a low-complexity high-throughput decoding architecture based on a sequential decoding algorithm is proposed for convolutional codes. Parallel Fano decoders are scheduled to the codewords in parallel input buffers according to buffe...
متن کاملTiming Recovery Problem
he last decade has seen the development of iteratively decodable error-control codes of unprecedented power, whose large coding gains enable reliable communication at very low signal-to-noise ratio (SNR). A by-product of this trend is that timing recovery must be performed at an SNR lower than ever before. Conventional timing recovery ignores the presence of error-control coding and is thus doo...
متن کامل